Degree distance and Gutman index of two graph products
نویسندگان
چکیده
منابع مشابه
The Multiplicative Versions of the Reciprocal Degree Distance and Reciprocal Gutman Index of Some Graph Products
In this paper, we provide exact value of the multiplicative version of the reciprocal degree distance and the multiplicative version of the reciprocal Gutman index of Cartesian product of complete graphs. Also, we establish sharp upper bounds for the multiplicative version of the reciprocal degree distance and multiplicative version of the reciprocal Gutman index of strong product of graphs.
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملdegree distance and gutman index of corona product of graphs
in this paper, the degree distance and the gutman index of the corona product of two graphs are determined. using the results obtained, the exact degree distance and gutman index of certain classes of graphs are computed.
متن کاملdegree distance and gutman index of increasing trees
the gutman index and degree distance of a connected graph $g$ are defined as begin{eqnarray*} textrm{gut}(g)=sum_{{u,v}subseteq v(g)}d(u)d(v)d_g(u,v), end{eqnarray*} and begin{eqnarray*} dd(g)=sum_{{u,v}subseteq v(g)}(d(u)+d(v))d_g(u,v), end{eqnarray*} respectively, where $d(u)$ is the degree of vertex $u$ and $d_g(u,v)$ is the distance between vertices $u$ and $v$. in th...
متن کاملDegree distance index of the Mycielskian and its complement
In this paper, we determine the degree distance of the complement of arbitrary Mycielskian graphs. It is well known that almost all graphs have diameter two. We determine this graphical invariant for the Mycielskian of graphs with diameter two.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra Combinatorics Discrete Structures and Applications
سال: 2020
ISSN: 2148-838X
DOI: 10.13069/jacodesmath.729422